Genetic and tabu search approaches for optimizing the hall call - Car allocation problem in elevator group systems

نویسندگان

  • Berna Bolat
  • Pablo Cortés
چکیده

The most common problem in vertical transportation using elevator group appears when a passenger wants to travel from a floor to other different floor in a building. The passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group. After that, the elevator controller receives the call and identifies which one of the elevators in the group is most suitable to serve the person having issued the call. In this paper, we have developed different elevator group controllers based on genetic and tabu search algorithms. Even though genetic algorithm has been previously considered in vertical transportation problems, the use of tabu search approaches is a novelty in vertical transportation and has not been considered previously. Tests have been carried out for high-rise buildings considering diverse sizes in the group of cars. Results indicate that the waiting time and journey time of passengers were significantly improved when dealing with such soft computing approaches. Also, a quickly evaluable solution quality function in the algorithms allows suitable computational times for industry implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A particle swarm optimization algorithm for optimal car-call allocation in elevator group control systems

High-rise buildings require the installation of complex elevator group control systems (EGCS). In vertical transportation, when a passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group, the EGCS must allocate one of the cars of the group to the hall call. We develop a Particle Swarm Optimization (PSO) algorithm to dea...

متن کامل

Pso and Tabu Search Approaches for the Car Allocation Problem in Multi-car Elevator Systems

Heavy vertical traffic conditions appear in high-rise buildings especially during the rush-hour period. So, offered service provided by multi-car elevator systems for such buildings during that period is expected to work fast, efficiently and without long waiting times for users. The approach of our work focuses on reducing the passengers travel and waiting times. To do so Particle Swarm Optimi...

متن کامل

A viral system algorithm to optimize the car dispatching in elevator group control systems of tall buildings

Nowadays is very common the presence of tall buildings in the business centres of the main cities of the world. Such buildings require the installation of numerous lifts that are coordinated and managed under a unique control system. Population working in the buildings follows a similar traffic pattern generating situations of traffic congestion. The problem arises when a passenger makes a hall...

متن کامل

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011